A greedy reduction algorithm for setup optimization

Faigle, U. and R. Schrader, A greedy reduction algorithm for setup optimization, Discrete Applied Mathematics 35 (1992) 73-79. A reduction algorithm for setup optimization in general ordered sets is proposed. Moreover, the class of weakly cycle-free or.iers is introduced. All orders in this class are Dilworth optimal. Cycle-free orders and bipartite Dilworth optimal orders are proper subclasses. The algorithm allows greedy setup optimization in cycle-free orders and coincides with the algorithm of Syslo et al. [S] in the class of bipartite orders.